The Extendable-Triple Property: A New CSP Tractable Class beyond BTP
نویسندگان
چکیده
Tractable classes constitute an important issue in Artificial Intelligence to define new islands of tractability for reasoning or problem solving. In the area of constraint networks, numerous tractable classes have been defined, and recently, the Broken Triangle Property (BTP (Cooper, Jeavons, and Salamon 2010)) has been shown as one of the most important of them, this class including several classes previously defined. In this paper, we propose a new class called ETP for Extendable-Triple Property, which generalizes BTP, by including it. Combined with the verification of the StrongPath-Consistency, ETP is shown to be a new tractable class. Moreover, this class inherits some desirable properties of BTP including the fact that the instances of this class can be solved thanks to usual algorithms (such as MAC or RFL) used in most solvers. We give the theoretical material about this new class and we present an experimental study which shows that from a practical viewpoint, it seems more usable in practice than BTP.
منابع مشابه
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems
As a central problem in AI, the Constraint Satisfaction Problem (CSP), has been a popular paradigm to cope with complex combinational problems. A CSP consists of a set of variables and a set of constraints restricting the combinations of values taken by variables. The Quantified Constraint Satisfaction Problem (QCSP) is a generalization of the CSP, where variables are existentially or universal...
متن کاملOn Broken Triangles
A binary CSP instance satisfying the broken-triangle property (BTP) can be solved in polynomial time. Unfortunately, in practice, few instances satisfy the BTP. We show that a local version of the BTP allows the merging of domain values in arbitrary instances of binary CSP, thus providing a novel polynomial-time reduction operation. Extensive experimental trials on benchmark instances demonstra...
متن کاملA Microstructure-Based Family of Tractable Classes for CSPs
The study of tractable classes is an important issue in Artificial Intelligence, especially in Constraint Satisfaction Problems. In this context, the Broken Triangle Property (BTP) is a state-of-the-art microstructure-based tractable class which generalizes well-known and previously-defined tractable classes, notably the set of instances whose constraint graph is a tree. In this paper, we propo...
متن کاملA Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP
Tractable classes of binary CSP and binary Max-CSP have recently been discovered by studying classes of instances defined by excluding subproblems. In this paper we characterise the complexity of all classes of binary Max-CSP instances defined by forbidding a single subproblem. In the resulting dichotomy, the only non-trivial tractable class defined by a forbidden subproblem corresponds to the ...
متن کاملBinary Constraint Satisfaction Problems Defined by Excluded Topological Minors
The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variables. A binary CSP instance can be presented as a labelled graph encoding both the forms of the constraints and where they are imposed. We consider subproblems defined by restricting the allowed form of this graph. One...
متن کامل